CRC 3: A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications
نویسندگان
چکیده
This document explains the design and use of the Church-Rosser checker tool CRC 3, which checks whether a (possibly conditional) equational specification satisfies the ChurchRosser property modulo any combination of associativity, and/or commutativity, and/or identity axioms (combinations of associativity without commutativity are handled only under certain conditions). This tool can be used to prove the Church-Rosser property of ordersorted equational specifications in Maude [11, 8, 12]. The tool has been written entirely in Maude and is in fact an executable specification in rewriting logic [42] of the formal inference system that it implements. The fact that rewriting logic is reflective [5, 17], and that Maude efficiently supports reflective rewriting logic computations [7, 9] is systematically exploited in the design of the tool.
منابع مشابه
A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications
The (ground) Church-Rosser property, together with termination, is essential for an equational specification to have good executability conditions, and also for having a complete agreement between the specification’s initial algebra, mathematical semantics, and its operational semantics by rewriting. Checking this property for expressive specifications that are order-sorted, conditional with po...
متن کاملOn the Church-Rosser and Coherence Properties of Conditional Order-Sorted Rewrite Theories1
In the effort to bring rewriting-based methods into contact with practical applications both in programing and in formal verification, there is a tension between: (i) expressiveness and generality—so that a wide range of applications can be expressed easily and naturally—, and (ii) support for formal verification, which is harder to get for general and expressive specifications. This paper answ...
متن کاملA Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E modulo A. The correctness of many important formal verification tasks, including search, LTL model checking, and the development of abstractions, crucially depends on the theory being ground coherent. Furthermore, many ...
متن کاملA Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories (Long Version)
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E modulo A. The correctness of many important formal verification tasks, including search, LTL model checking, and the development of abstractions, crucially depends on the theory being ground coherent. Furthermore, many ...
متن کاملOn the Completeness of Context-Sensitive Order-Sorted Specifications
We propose three different notions of completeness for term rewrite specifications supporting order-sorted signatures, deduction modulo axioms, and context-sensitive rewriting relative to a replacement map μ. Our three notions are: (1) an appropriate definition of μ-sufficient completeness with respect to a set of constructor symbols; (2) a definition of μ-canonical completeness under which μ-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009